图的深度优先和广度优先遍历算法（用邻接表作为存储结构）

#include"stdio.h"
#include"string.h"
#include"stdlib.h"
#include"math.h"

#define MAX_INT 1000
#define MAX_VERTEX_NUM 20
#define MAX_QUEUE_NUMBER 20

//采用邻接表存储结构
typedef struct ArcNode
{
 int adjvex;
 double adj;
 struct ArcNode *nextarc;
}ArcNode;
typedef struct VexNode
{
 char szName[40];
 ArcNode *firstarc;
}VexNode,AdjList[MAX_VERTEX_NUM];
typedef struct
{
 AdjList vexs;
 int vexnum,arcnum;
}Net;

/*-----------------------队的基本操作---------------------*/
typedef struct{
 int *elem;
 int front, rear;
}Queue;
void InitQueue(Queue &Q)
{
 Q.elem = (int *)malloc(MAX_QUEUE_NUMBER*sizeof(int));
 Q.front = Q.rear = 0;
}
int EmptyQueue(Queue Q)
{
 if(Q.front==Q.rear)